Precedence constrained parallel-machine scheduling of position-dependent jobs
نویسندگان
چکیده
منابع مشابه
Single Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
متن کاملPrecedence-Constrained Scheduling of Malleable Jobs with Preemption
Scheduling jobs with precedence constraints on a set of identical machines to minimize the total processing time (makespan) is a fundamental problem in combinatorial optimization. In practical settings such as cloud computing, jobs are often malleable, i.e., can be processed on multiple machines simultaneously. The instantaneous processing rate of a job is a non-decreasing function of the numbe...
متن کاملA half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine
We present a new linear programming relaxation for the problem of minimizing the sum of weighted completion times of precedence-constrained jobs. Given a set of n jobs, each job j has processing time p j and weight w j. There is also a partial order on the execution of the jobs: if j k, job k may not start processing before job j has been completed. For C j representing the completion time of j...
متن کاملSingle Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs and a mathematical model based on binary integer programming (BIP) is developed. Since the precedence constraints exist, a job cannot start before completion of its all predecessors. The proposed model consists of two steps: in the first step, the earliest starting time of each job is c...
متن کاملScheduling jobs with position-dependent processing times
Bachman and Janiak provided a sketch of the proof that the problem 1|ri,pi(v)1⁄4 ai/v|Cmax is NP-hard in the strong sense. However, they did not show how to avoid using harmonic numbers whose encoding is not pseudo-polynomial, which makes the proof incomplete. In this corrigendum, we provide a new complete proof. Journal of the Operational Research Society (2012) 63, 1018–1020. doi:10.1057/jors...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Letters
سال: 2016
ISSN: 1862-4472,1862-4480
DOI: 10.1007/s11590-016-1075-8